Stochastic chemical kinetics and the quasi-steady-state assumption: Application to the Gillespie algorithm

نویسندگان

  • Christopher V. Rao
  • Adam P. Arkin
چکیده

Biochemical dynamics are often determined by series of single molecule events such as gene expression and reactions involving protein concentrations at nanomolar concentrations. Molecular fluctuations, consequently, may be of biological significance. For example, heterogeneity in clonal populations is believed to arise from molecular fluctuations in gene expression. A realistic description, therefore, requires a probabilistic description of the biochemical dynamics as deterministic descriptions cannot capture the inherent molecular fluctuations. The Gillespie algorithm @D. T. Gillespie, J. Phys. Chem. 81, 2350 ~1977!# is a stochastic procedure for simulating chemical systems at low concentrations. A limitation of stochastic kinetic models is that they require detailed information about the chemical kinetics often unavailable in biological systems. Furthermore, the Gillespie algorithm is computationally intensive when there are many molecules and reaction events. In this article, we explore one approximation technique, well known in deterministic kinetics, for simplifying the stochastic model: the quasi-steady-state assumption ~QSSA!. We illustrate how the QSSA can be applied to the Gillespie algorithm. Using the QSSA, we derive stochastic Michaelis–Menten rate expressions for simple enzymatic reactions and illustrate how the QSSA is applied when modeling and simulating a simple genetic circuit. © 2003 American Institute of Physics. @DOI: 10.1063/1.1545446#

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic chemical kinetics and the total quasi-steady-state assumption: application to the stochastic simulation algorithm and chemical master equation.

Recently the application of the quasi-steady-state approximation (QSSA) to the stochastic simulation algorithm (SSA) was suggested for the purpose of speeding up stochastic simulations of chemical systems that involve both relatively fast and slow chemical reactions [Rao and Arkin, J. Chem. Phys. 118, 4999 (2003)] and further work has led to the nested and slow-scale SSA. Improved numerical eff...

متن کامل

Two classes of quasi-steady-state model reductions for stochastic kinetics.

The quasi-steady-state approximation (QSSA) is a model reduction technique used to remove highly reactive species from deterministic models of reaction mechanisms. In many reaction networks the highly reactive intermediates (QSSA species) have populations small enough to require a stochastic representation. In this work we apply singular perturbation analysis to remove the QSSA species from the...

متن کامل

A simulation study of calcium release channel

The IP3R calcium release channel has been simulated using a stochastic simulation algorithm (SSA;Gillespie algorithm) and De young-Keiser model. A set of different concentration for Cat' and IP3 havebeen used. Considering the Number of molecules in each state, a non linear behavior of the system can beseen clearly. The inhibiting role of the Ca+2 on the open state (X110) has been studied. The d...

متن کامل

Constrained approximation of effective generators for multiscale stochastic reaction networks and application to conditioned path sampling

Efficient analysis and simulation of multiscale systems of chemical kinetics is an ongoing area for research, and is the source of many theoretical and computational challenges. In this paper, we present a significant improvement to the constrained approach, which allows us to compute the effective generator of the slow variables, without the need for expensive stochastic simulations. Moreover,...

متن کامل

Variance reduction for steady-state simulation and sensitivity analysis of stochastic chemical systems

We address the problem of estimating steady-state quantities associated to systems of stochastic chemical kinetics. In most cases of interest these systems are analytically intractable, and one has to resort to computational methods to estimate stationary values of cost functions. In this work we consider a previously introduced variance reduction method and present an algorithm for its applica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003